Modified Round Robin Scheduling Algorithm Using Variable Time Slice

CPU scheduling is the basis of multi-programmed operating systems. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. Round Robin assumes that all processes are equally important; each receives an equal portion (time slice) of the CPU. This will sometimes affect the performance of CPU. This paper considers the problem of fixed time slice. We propose a modified version of the Round Robin Algorithm that is based upon the variation in time slice to improve the performance of the system. We finally compare our new algorithm with the existing one in terms of waiting time.